Upper Distance k-Cost Effective Number in the Join of Graphs
نویسندگان
چکیده
منابع مشابه
The locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe upper domatic number of powers of graphs
Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...
متن کاملSIGNED ROMAN DOMINATION NUMBER AND JOIN OF GRAPHS
In this paper we study the signed Roman dominationnumber of the join of graphs. Specially, we determine it for thejoin of cycles, wheels, fans and friendship graphs.
متن کاملthe locating chromatic number of the join of graphs
let $f$ be a proper $k$-coloring of a connected graph $g$ and $pi=(v_1,v_2,ldots,v_k)$ be an ordered partition of $v(g)$ into the resulting color classes. for a vertex $v$ of $g$, the color code of $v$ with respect to $pi$ is defined to be the ordered $k$-tuple $c_{{}_pi}(v)=(d(v,v_1),d(v,v_2),ldots,d(v,v_k))$, where $d(v,v_i)=min{d(v,x):~xin v_i}, 1leq ileq k$. if distinct...
متن کاملUpper bounds for the k-subdomination number of graphs
For a positive integer k, a k-subdominating function of G=(V; E) is a function f :V → {−1; 1} such that the sum of the function values, taken over closed neighborhoods of vertices, is at least one for at least k vertices of G. The sum of the function values taken over all vertices is called the aggregate of f and the minimum aggregate among all k-subdominating functions of G is the k-subdominat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2020
ISSN: 1307-5543
DOI: 10.29020/nybg.ejpam.v13i3.3657